51![On Streaming and Communication Complexity of the Set Cover Problem Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, and Ali Vakilian Massachusetts Instittute of Technology (MIT) {edemaine,indyk,mahabadi,vakilian}@mit.edu On Streaming and Communication Complexity of the Set Cover Problem Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, and Ali Vakilian Massachusetts Instittute of Technology (MIT) {edemaine,indyk,mahabadi,vakilian}@mit.edu](https://www.pdfsearch.io/img/962ea0a4bec14ff58cb84a1690901635.jpg) | Add to Reading ListSource URL: www.mit.eduLanguage: English - Date: 2014-08-06 12:02:47
|
---|
52![Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality Sariel Har-Peled∗ Piotr Indyk† Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality Sariel Har-Peled∗ Piotr Indyk†](https://www.pdfsearch.io/img/3c8ef790ccaa5b0a90c0914481ef0366.jpg) | Add to Reading ListSource URL: sarielhp.orgLanguage: English - Date: 2012-08-03 11:55:38
|
---|
53![Approximate Line Nearest Neighbor in High Dimensions Alexandr Andoni MIT Piotr Indyk MIT Approximate Line Nearest Neighbor in High Dimensions Alexandr Andoni MIT Piotr Indyk MIT](https://www.pdfsearch.io/img/a85219af4159aa41de4a63dab2a2c2ec.jpg) | Add to Reading ListSource URL: www.mit.eduLanguage: English - Date: 2008-10-14 01:55:32
|
---|
54![A Fast Approximation Algorithm for Tree-Sparse Recovery Chinmay Hegde, Piotr Indyk, Ludwig Schmidt1 Massachusetts Institute of Technology Abstract—Sparse signals whose nonzeros obey a tree-like A Fast Approximation Algorithm for Tree-Sparse Recovery Chinmay Hegde, Piotr Indyk, Ludwig Schmidt1 Massachusetts Institute of Technology Abstract—Sparse signals whose nonzeros obey a tree-like](https://www.pdfsearch.io/img/27b1b7a2c828ec2ff257a16dc18f43a1.jpg) | Add to Reading ListSource URL: people.csail.mit.eduLanguage: English - Date: 2015-05-25 21:19:33
|
---|
55![Overcoming the `1 Non-Embeddability Barrier: Algorithms for Product Metrics Alexandr Andoni MIT Piotr Indyk Overcoming the `1 Non-Embeddability Barrier: Algorithms for Product Metrics Alexandr Andoni MIT Piotr Indyk](https://www.pdfsearch.io/img/964afc14213423562a1abbfb02fd6717.jpg) | Add to Reading ListSource URL: people.csail.mit.eduLanguage: English - Date: 2009-07-09 16:38:42
|
---|
56![Overcoming the `1 Non-Embeddability Barrier: Algorithms for Product Metrics Alexandr Andoni MIT Piotr Indyk Overcoming the `1 Non-Embeddability Barrier: Algorithms for Product Metrics Alexandr Andoni MIT Piotr Indyk](https://www.pdfsearch.io/img/fcf1a3e2392389885c909efe0c41fd53.jpg) | Add to Reading ListSource URL: www.mit.eduLanguage: English - Date: 2008-10-14 01:55:03
|
---|
57![K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance∗ Piotr Indyk Eric Price K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance∗ Piotr Indyk Eric Price](https://www.pdfsearch.io/img/9c3553320e53726d1b98d9cabd813715.jpg) | Add to Reading ListSource URL: people.csail.mit.eduLanguage: English - Date: 2011-06-05 23:48:27
|
---|
58![On Model–Based RIP–1 Matrices Piotr Indyk Ilya Razenshteyn MIT, CSAIL On Model–Based RIP–1 Matrices Piotr Indyk Ilya Razenshteyn MIT, CSAIL](https://www.pdfsearch.io/img/9eab9cead75b70191e07ac887459837f.jpg) | Add to Reading ListSource URL: www.ilyaraz.orgLanguage: English - Date: 2013-07-18 11:12:24
|
---|
59![Earth Mover Distance over High-Dimensional Spaces∗ Alexandr Andoni† MIT Piotr Indyk Earth Mover Distance over High-Dimensional Spaces∗ Alexandr Andoni† MIT Piotr Indyk](https://www.pdfsearch.io/img/055122ec5797a24d646b37bff073a3f0.jpg) | Add to Reading ListSource URL: www.mit.eduLanguage: English - Date: 2008-03-14 11:55:09
|
---|
60![On the Power of Adaptivity in Sparse Recovery Piotr Indyk Eric Price David P. Woodruff On the Power of Adaptivity in Sparse Recovery Piotr Indyk Eric Price David P. Woodruff](https://www.pdfsearch.io/img/079843a237144c375b5a9c91234f6ffc.jpg) | Add to Reading ListSource URL: people.csail.mit.eduLanguage: English - Date: 2011-08-18 18:49:13
|
---|